An even faster solver for general systems of equations
Identifieur interne : 000282 ( LNCS/Analysis ); précédent : 000281; suivant : 000283An even faster solver for general systems of equations
Auteurs : Christian Fecht [Allemagne] ; Helmut Seidl [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1996.
Descripteurs français
- Pascal (Inist)
English descriptors
Abstract
Abstract: We present a new algorithm which computes a partial approximate solution for a system of equations. It is local in that it considers as few variables as necessary in order to compute the values of those variables we are interested in, it is generic in that it makes no assumptions on the application domain, and it is general in that the algorithm does not depend on any specific properties of right-hand sides of equations. For instance, monotonicity is not required. However, in case the right-hand sides satisfy some weak monotonicity property, our algorithm returns the (uniquely defined) least solution. The algorithm meets the best known theoretical worstcase complexity of similar algorithms. For the application of analyzing logic languages, it also gives the best practical results on most of our real world benchmark programs.
Url:
DOI: 10.1007/3-540-61739-6_42
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001410
- to stream Istex, to step Curation: 001298
- to stream Istex, to step Checkpoint: 001074
- to stream Main, to step Merge: 002C74
- to stream PascalFrancis, to step Corpus: 001421
- to stream PascalFrancis, to step Curation: 001571
- to stream PascalFrancis, to step Checkpoint: 001233
- to stream Main, to step Merge: 002D35
- to stream Main, to step Curation: 002800
- to stream Main, to step Exploration: 002800
- to stream LNCS, to step Extraction: 000282
Links to Exploration step
ISTEX:F7740819D607C7BD061760F6AC0A8A775D41E521Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">An even faster solver for general systems of equations</title><author><name sortKey="Fecht, Christian" sort="Fecht, Christian" uniqKey="Fecht C" first="Christian" last="Fecht">Christian Fecht</name></author><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F7740819D607C7BD061760F6AC0A8A775D41E521</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1007/3-540-61739-6_42</idno><idno type="url">https://api.istex.fr/document/F7740819D607C7BD061760F6AC0A8A775D41E521/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001410</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001410</idno><idno type="wicri:Area/Istex/Curation">001298</idno><idno type="wicri:Area/Istex/Checkpoint">001074</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001074</idno><idno type="wicri:doubleKey">0302-9743:1996:Fecht C:an:even:faster</idno><idno type="wicri:Area/Main/Merge">002C74</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:97-0022184</idno><idno type="wicri:Area/PascalFrancis/Corpus">001421</idno><idno type="wicri:Area/PascalFrancis/Curation">001571</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">001233</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001233</idno><idno type="wicri:doubleKey">0302-9743:1996:Fecht C:an:even:faster</idno><idno type="wicri:Area/Main/Merge">002D35</idno><idno type="wicri:Area/Main/Curation">002800</idno><idno type="wicri:Area/Main/Exploration">002800</idno><idno type="wicri:Area/LNCS/Extraction">000282</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">An even faster solver for general systems of equations</title><author><name sortKey="Fecht, Christian" sort="Fecht, Christian" uniqKey="Fecht C" first="Christian" last="Fecht">Christian Fecht</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1996</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">F7740819D607C7BD061760F6AC0A8A775D41E521</idno><idno type="DOI">10.1007/3-540-61739-6_42</idno><idno type="ChapterID">14</idno><idno type="ChapterID">Chap14</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm complexity</term><term>Equation system solving</term><term>Fast algorithm</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Algorithme rapide</term><term>Complexité algorithme</term><term>Résolution système équation</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We present a new algorithm which computes a partial approximate solution for a system of equations. It is local in that it considers as few variables as necessary in order to compute the values of those variables we are interested in, it is generic in that it makes no assumptions on the application domain, and it is general in that the algorithm does not depend on any specific properties of right-hand sides of equations. For instance, monotonicity is not required. However, in case the right-hand sides satisfy some weak monotonicity property, our algorithm returns the (uniquely defined) least solution. The algorithm meets the best known theoretical worstcase complexity of similar algorithms. For the application of analyzing logic languages, it also gives the best practical results on most of our real world benchmark programs.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Fecht, Christian" sort="Fecht, Christian" uniqKey="Fecht C" first="Christian" last="Fecht">Christian Fecht</name></noRegion><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000282 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000282 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:F7740819D607C7BD061760F6AC0A8A775D41E521
|texte= An even faster solver for general systems of equations
}}
| This area was generated with Dilib version V0.6.31. |  |